a(b(a(a(x1)))) → c(b(a(b(a(x1)))))
a(c(b(x1))) → a(a(b(c(b(a(x1))))))
↳ QTRS
↳ DependencyPairsProof
a(b(a(a(x1)))) → c(b(a(b(a(x1)))))
a(c(b(x1))) → a(a(b(c(b(a(x1))))))
A(b(a(a(x1)))) → A(b(a(x1)))
A(c(b(x1))) → A(x1)
A(c(b(x1))) → A(a(b(c(b(a(x1))))))
A(c(b(x1))) → A(b(c(b(a(x1)))))
a(b(a(a(x1)))) → c(b(a(b(a(x1)))))
a(c(b(x1))) → a(a(b(c(b(a(x1))))))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
A(b(a(a(x1)))) → A(b(a(x1)))
A(c(b(x1))) → A(x1)
A(c(b(x1))) → A(a(b(c(b(a(x1))))))
A(c(b(x1))) → A(b(c(b(a(x1)))))
a(b(a(a(x1)))) → c(b(a(b(a(x1)))))
a(c(b(x1))) → a(a(b(c(b(a(x1))))))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDPOrderProof
↳ QDP
A(b(a(a(x1)))) → A(b(a(x1)))
a(b(a(a(x1)))) → c(b(a(b(a(x1)))))
a(c(b(x1))) → a(a(b(c(b(a(x1))))))
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
A(b(a(a(x1)))) → A(b(a(x1)))
The value of delta used in the strict ordering is 1/16.
POL(c(x1)) = 1/2
POL(a(x1)) = 1/4 + x_1
POL(A(x1)) = (1/2)x_1
POL(b(x1)) = (1/2)x_1
a(b(a(a(x1)))) → c(b(a(b(a(x1)))))
a(c(b(x1))) → a(a(b(c(b(a(x1))))))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
↳ QDP
a(b(a(a(x1)))) → c(b(a(b(a(x1)))))
a(c(b(x1))) → a(a(b(c(b(a(x1))))))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDPOrderProof
A(c(b(x1))) → A(x1)
a(b(a(a(x1)))) → c(b(a(b(a(x1)))))
a(c(b(x1))) → a(a(b(c(b(a(x1))))))
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
A(c(b(x1))) → A(x1)
The value of delta used in the strict ordering is 2.
POL(c(x1)) = 1 + x_1
POL(A(x1)) = (2)x_1
POL(b(x1)) = x_1
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
a(b(a(a(x1)))) → c(b(a(b(a(x1)))))
a(c(b(x1))) → a(a(b(c(b(a(x1))))))